<HTML><HEAD><TITLE>min_of_heap(+Heap, ?Key1, ?Datum1, ?Key2, ?Datum2)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(heaps)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>min_of_heap(+Heap, ?Key1, ?Datum1, ?Key2, ?Datum2)</H1>
returns the smallest and second smallest pairs in the heap
<H2>Description</H2>

    returns the smallest (Key1) and second smallest (Key2) pairs in
    the heap, without deleting them.  It fails if the heap does not
    have at least two elements.
    

</BODY></HTML>
